A List-machine Benchmark for Mechanized Metatheory
نویسندگان
چکیده
منابع مشابه
A List - machine Benchmark for Mechanized Metatheory ( Extended Abstract ) Andrew
We propose a benchmark to compare theorem-proving systems on their ability to express proofs of compiler correctness. In contrast to the first POPLmark, we emphasize the connection of proofs to compiler implementations, and we point out that much can be done without binders or alpha-conversion. We propose specific criteria for evaluating the utility of mechanized metatheory systems; we have con...
متن کاملA List-machine Benchmark for Mechanized Metatheory: (Extended Abstract)
We propose a benchmark to compare theorem-proving systems on their ability to express proofs of compiler correctness. In contrast to the first POPLmark, we emphasize the connection of proofs to compiler implementations, and we point out that much can be done without binders or alpha-conversion. We propose specific criteria for evaluating the utility of mechanized metatheory systems; we have con...
متن کاملMechanized metatheory revisited
Proof assistants and the programming languages that implement them need to deal with a range of linguistic expressions that involve bindings. Since most mature proof assistants do not have built-in methods to treat this aspect of syntax, they have been extended with various packages and libraries that allow them to encode such syntax using, for example, de Bruijn numerals and nominal logic feat...
متن کاملMechanized metatheory revisited (abstract)
Over a decade ago, the POPLmark challenge [2] suggested that the theorem proving community had tools that were close to being usable by programming language researchers to formally prove properties of their designs and implementations. The authors of the POPLmark challenge looked at existing practices and systems and urged the developers of proof assistants to make improvements to existing syst...
متن کاملA Metatheory of a Mechanized Object Theory
(51) We apply 8I to (51) and prove (49). P and t are deened inductively over the structure of sequent trees. In the base case, we have P and t such that (47) is 8x (T(x) T(x)). Consider now the step case. We write (47) in the following form. (52) where P x 1 ; :::; x n ] does not contain occurrences of T. We assume the hypotheses of (52) and derive Tac(x 1) ^ ::: ^ Tac(x m). From (29) we obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.01.020